Prolegomena to the De nition of Dynamic Predicate Logic with Local Assignments
نویسنده
چکیده
In this paper we subject the possible ways to de ne versions of DPL with local assignments to a thorough and detailed scrutiny We hope that our treatment is suggestive of the proper abstract view of dynamic logics that we would like to arrive at eventually
منابع مشابه
Prolegomena to the Deenition of Dynamic Predicate Logic with Local Assignments
In this paper we subject the possible ways to deene versions of DPL with local assignments to a thorough and detailed scrutiny. We hope that our treatment is suggestive of the properàbstract' view of dynamic logics that we would like to arrive at eventually.
متن کاملSequence semantics for dynamic predicate logic
In this paper a semantics for dynamic predicate logic is developed that uses sequence valued assignments This semantics is compared with the usual relational semantics for dynamic predicate logic it is shown that the most important intuitions of the usual se mantics are preserved Then it is shown that the re ned semantics re ects out intuitions about information growth Some other issues in dyna...
متن کاملContexts in Dynamic Predicate Logic
In this paper we introduce a notion of context for Groenendijk Stokhof s Dynamic Predicate Logic DPL We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests conditions and random resettings in the case that we are working over an in nite domain These relations are precisely the ones de nable in DPL if we allow ourselves ar...
متن کاملModal Foundations for Predicate Logic
The complexity of any logical modeling reeects both the intrinsic structure of a topic described and the weight of the formal tools. Some of this weight seems inherent in even the most basic logical systems. Notably, standard predicate logic is undecidable. In this paper, we investigatèlighter' versions of this general purpose tool, by modally`deconstructing' the usual semantics, and locating i...
متن کاملA proof outline logic for object-oriented programming
This paper describes a proof outline logic that covers most typical object-oriented language constructs in the presence of inheritance and subtyping. The logic is based on a weakest precondition calculus for assignments and object allocation which takes field shadowing into account. Dynamically bound method calls are tackled with a variant of Hoare’s rule of adaptation that deals with the dynam...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997